Evolutionary Induction of Sparse Neural Trees
نویسندگان
چکیده
منابع مشابه
Evolutionary Induction of Sparse Neural Trees
This paper is concerned with the automatic induction of parsimonious neural networks. In contrast to other program induction situations, network induction entails parametric learning as well as structural adaptation. We present a novel representation scheme called neural trees that allows efficient learning of both network architectures and parameters by genetic search. A hybrid evolutionary me...
متن کاملEvolutionary Induction of Sparse Neural
This paper is concerned with the automatic induction of parsimonious neural networks. In contrast to other program induction situations, network induction entails parametric learning as well as structural adaptation. We present a novel representation scheme, called neural trees, that allows eecient learning of network architectures and parameters both by genetic search. A hybrid evolutionary me...
متن کاملEvolutionary Induction of Cost-Sensitive Decision Trees
In the paper, a new method for cost-sensitive learning of decision trees is proposed. Our approach consists in extending the existing evolutionary algorithm (EA) for global induction of decision trees. In contrast to the classical top-down methods, our system searches for the whole tree at the moment. We propose a new fitness function which allows the algorithm to minimize expected cost of clas...
متن کاملLearning to Predict by Evolutionary Neural Trees
An evolut<onary learning method for modeling and predicting complex systems is described. The method is based on tree-structured neural networks whose node type, weight, size and topology are dynamically adapted by genetic algorithms. Since the genetic algorithm used for training does not require error derivatives, a wide range of neural models can be explored. The application of this method to...
متن کاملEvolutionary Induction of Decision Trees for Misclassification Cost Minimization
In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed approach optimal trees are searched in a global manner by using an evolutionary algorithm (EA). Specialized genetic operators are applied to modify both the tree structure and tests in non-terminal nodes. A suitably defined fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 1997
ISSN: 1063-6560,1530-9304
DOI: 10.1162/evco.1997.5.2.213